Dynamic programming and Gaussian elimination
نویسندگان
چکیده
منابع مشابه
Gaussian process dynamic programming
Reinforcement learning (RL) and optimal control of systems with continuous states and actions require approximation techniques in most interesting cases. In this article, we introduce Gaussian process dynamic programming (GPDP), an approximate value-function based RL algorithm. We consider both a classic optimal control problem, where problem-specific prior knowledge is available, and a classic...
متن کاملGaussian elimination
As the standard method for solving systems of linear equations, Gaussian elimination (GE) is one of the most important and ubiquitous numerical algorithms. However, its successful use relies on understanding its numerical stability properties and how to organize its computations for efficient execution on modern computers. We give an overview of GE, ranging from theory to computation. We explai...
متن کاملGaussian Elimination and LU-Decomposition
Solving a set of linear equations arises in many contexts in applied mathematics. At least until recently, a claim could be made that solving sets of linear equations (generally as a component of dealing with larger problems like partial-differential-equation solving, or optimization, consumes more computer time than any other computational procedure. (Distant competitors would be the Gram-Schm...
متن کاملExtended Frege and Gaussian Elimination
We show that the Gaussian Elimination algorithm can be proven correct with uniform Extended Frege proofs of polynomial size, and hence feasibly. More precisely, we give short uniform Extended Frege proofs of the tautologies that express the following: given a matrix A, the Gaussian Elimination algorithm reduces A to row-echelon form. We also show that the consequence of this is that a large cla...
متن کاملHow Ordinary Elimination Became Gaussian Elimination
Newton, in an unauthorized textbook, described a process for solving simultaneous equations that later authors applied specifically to linear equations. This method — that Newton did not want to publish, that Euler did not recommend, that Legendre called “ordinary,” and that Gauss called “common” — is now named after Gauss: “Gaussian” elimination. (One suspects, he would not be amused.) Gauss’s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1962
ISSN: 0022-247X
DOI: 10.1016/0022-247x(62)90021-5